EVOLVING SCALE-FREE NETWORK MODEL WITH TUNABLE CLUSTERING
نویسندگان
چکیده
منابع مشابه
Evolving Scale-free Network Model with Tunable Clustering
The Barabási-Albert (BA) model is extended to include the concept of local world and the microscopic event of adding edges. With probability p, we add a new node with m edges which preferentially link to the nodes presented in the network; with probability 1− p, we add m edges among the present nodes. A node is preferentially selected by its degree to add an edge randomly among its neighbors. U...
متن کاملGrowing scale-free networks with tunable clustering.
We extend the standard scale-free network model to include a "triad formation step." We analyze the geometric properties of networks generated by this algorithm both analytically and by numerical calculations, and find that our model possesses the same characteristics as the standard scale-free networks such as the power-law degree distribution and the small average geodesic length, but with th...
متن کاملLocal-world evolving networks with tunable clustering
We propose an extended local-world evolving network model including a triad formation step. In the process of network evolution, random fluctuation in the number of new edges is involved. We derive analytical expressions for degree distribution, clustering coefficient and average path length. Our model can unify the generic properties of real-life networks: scale-free degree distribution, high ...
متن کاملComplex scale-free networks with tunable power-law exponent and clustering
We introduce a network evolution process motivated by the network of citations in the scientific literature. In each iteration of the process a node is born and directed links are created from the new node to a set of target nodes already in the network. This set includes m “ambassador” nodes and l of each ambassador’s descendants where m and l are random variables selected from any choice of d...
متن کاملExactly solvable scale-free network model.
We study a deterministic scale-free network recently proposed by Barabási, Ravasz, and Vicsek. We find that there are two types of nodes: the hub and rim nodes, which form a bipartite structure of the network. We first derive the exact numbers P (k) of nodes with degree k for the hub and rim nodes in each generation of the network, respectively. Using this, we obtain the exact exponents of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modern Physics B
سال: 2005
ISSN: 0217-9792,1793-6578
DOI: 10.1142/s0217979205032437